Speculative Scheduling of Parameter Sweep Applications Using Job Behavior Descriptions

نویسندگان

  • Attila Ulbert
  • László Csaba Lorincz
  • Tamás Kozsik
  • Zoltán Horváth
چکیده

The execution of data intensive Grid applications raises several questions regarding job scheduling, data migration, and replication. This paper presents new scheduling algorithms using more sophisticated job behaviour descriptions that allow estimating job completion times more precisely thus improving scheduling decisions. Three approaches of providing input to the decision procedure are discussed: a) single job description, b) multiple job descriptions, and c) multiple job descriptions with mutation. The proposed Grid middleware components (1) monitor the execution of jobs and gather resource access information, (2) analyse the compiled information and generate a description of the behaviour of the job, (3) refine the already existing job description, and (4) use the refined behaviour description to schedule the submitted jobs. DOI: 10.4018/978-1-60960-603-9.ch005

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Economic-Based Scheduling Heuristic for Computational Grids

In the economic-based computational grids we need effective schedulers not only to minimize the makespan but also to minimize the costs that are spent for the execution of the jobs. In this work, a novel economy driven job scheduling heuristic is proposed and a simulation application is developed by using GridSim toolkit to investigate the performance of the heuristic. The simulation-based expe...

متن کامل

Distributed job scheduling based on Swarm Intelligence: A survey

Scientists and engineers need computational power to satisfy the increasing resource intensive nature of their simulations. For example, running Parameter Sweep Experiments (PSE) involve processing many independent jobs, given by multiple initial configurations (input parameter values) against the same program code. Hence, paradigms like Grid Computing and Cloud Computing are employed for gaini...

متن کامل

An ACO-inspired algorithm for minimizing weighted flowtime in cloud-based parameter sweep experiments

Parameter Sweep Experiments (PSEs) allow scientists and engineers to conduct experiments by running the same program code against different input data. This usually results in many jobs with high computational requirements. Thus, distributed environments, particularly Clouds, can be employed to fulfill these demands. However, job scheduling is challenging as it is an NPcomplete problem. Recentl...

متن کامل

Grids with multiple batch systems for performance enhancement of multi-component and parameter sweep parallel applications

In this work, we evaluate the benefits of using Grids with multiple batch systems to improve the performance of multi-component and parameter sweep parallel applications by reduction in queue waiting times. Using different job traces of different loads, job distributions and queue waiting times corresponding to three different queuing policies (FCFS, conservative and EASY backfilling), we condu...

متن کامل

Heuristics for Scheduling Parameter Sweep Applications in Grid Environments

The Computational Grid provides a promising platform for the eÆcient execution of parameter sweep applications over very large p arameter spaces. Sche duling such applications is challenging because target resour ces are heter ogene ous,because their load and availability varies dynamically, and because independent tasks may share common data les. In this p ap er, we pr op ose an adaptive sched...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJGHPC

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2009